Broadcasting on Meshes with Wormhole Routing
نویسندگان
چکیده
We address the problem of broadcasting on mesh architectures with arbitrary (non-power-two) dimensions. It is assumed that such mesh architectures employ cut-through or worm-hole routing. The main results are an algorithm for performing an optimal minimum-spanning tree broadcast when messages are not pipelined, a pipelined algorithm that is similar to Ho and Johnson's EDST algorithm for hypercubes, and a novel scatter-collect approach that is a natural choice for communication libraries due to its simplicity. Results obtained on the Intel Touchstone Delta system are included.
منابع مشابه
All-to-All Communication on Meshes with Wormhole Routing
This paper describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. We discuss both direct algorithms, in which data is sent directly from source to destination processor, and indirect algorithms in which data is sent through one or more intermediate processors. We propose algorithms for both power-of-two and non power-...
متن کاملOptimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-toall broadcast algorithm supposing that routers implement distanc...
متن کاملDirected Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract)
A digraph G with minimum in-degree d and minimum out-degree d is said to have a directed hamiltonian packing if G has d link-disjoint directed hamiltonian cycles. We show that a d-dimensional N1 N d mesh, when Ni 2d is even, has a directed hamiltonian packing, where an edge (u; v) in G is regarded as two directed links hu; vi and hv; ui. As its application, we design a time-eecient all-to-all b...
متن کاملStructured Communication in Cut-through Routed Torus Networks
This paper is a study of one-to-all and all-to-all data movement patterns on cycles and multi-dimensional toroidal meshes that use cut-through (e.g., circuit-switched, wormhole) routing with virtual channels. We present new cut-through algorithms for broadcasting, scattering, gossiping, and multi-scattering on cycles and multi-dimensional torus networks. Our algorithms use virtual channels to i...
متن کاملEfficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
In this paper, a network-partitioning approach for one-to-all broadcasting on wormhole-routed networks is proposed. To broadcast a message, the scheme works in three phases. First, a number of data-distributing networks (DDNs), which can work independently, are constructed. Then the message is evenly divided into sub-messages each being sent to a representative node in one DDN. Second, the sub-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 35 شماره
صفحات -
تاریخ انتشار 1996